Lifting Methods in Mass Partition Problems

نویسندگان

چکیده

Abstract Many results about mass partitions are proved by lifting $\mathds {R}^d$ to a higher-dimensional space and dividing the into pieces. We extend such methods use arguments polyhedral surfaces. Among other results, we prove existence of equipartitions $d+1$ measures in parallel hyperplanes $d+2$ concentric spheres. For whose supports sufficiently well separated, where one can cut fixed (possibly different) fraction each measure either hyperplanes, spheres, convex surfaces few facets, or polytopes with vertices.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Methods to measure mass transfer ki - netics , partition ratios and

........................................................................................................... i Sammanfattning ............................................................................................. iii Samenvatting .................................................................................................. v List of papers ................................................

متن کامل

Open Problems in Partition Regularity

A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax = 0. Many of the classical theorems of Ramsey Theory may naturally be interpreted as assertions that particular matrices are partition regular. While in the finite case partition regularity is well understood, very little...

متن کامل

Partition problems in discrete geometry

This Thesis deals with the following type of problems, which we denote partition problems, Given a set X in IR, is there a way to partition X such that the convex hulls of all parts satisfy certain combinatorial properties? We focus on the following two kinds of partition problems. • Tverberg type partitions. In this setting, one of the properties we ask the sets to satisfy is that their convex...

متن کامل

Linear-shaped partition problems

We establish the polynomial-time solvability of a class of vector partition problems with linear objectives subject to restrictions on the number of elements in each part. c © 2000 Published by Elsevier Science B.V. All rights reserved. 1. Shaped partition problems The shaped partition problem concerns the partitioning of n vectors A; : : : ; A in d-space into p parts so as to maximize an objec...

متن کامل

On uniform k-partition problems

We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A fe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2022

ISSN: ['1687-0247', '1073-7928']

DOI: https://doi.org/10.1093/imrn/rnac224